γ-Independent H∞-Discretization of Sampled-Data Systems by Modified Fast-Sample/Fast-Hold Approximation with Fast Lifting
نویسندگان
چکیده
This paper is concerned with H∞-discretization for analysis and design of sampled-data control systems and provides a new method with an approximation approach called modified fast-sample/fast-hold approximation. By applying the fast-lifting technique, quasi-finite-rank approximation of an infinite-rank operator and then the loop-shifting technique, this new method can discretize the continuous-time generalized plant in a γ-independent fashion even when the given sampleddata system has a nonzero direct feedthrough term from the disturbance input w to the controlled output z, unlike in the previous study. With this new method, we can obtain both the upper and lower bounds of the H∞-norm or the frequency response gain of any sampled-data systems regardless of the existence of nonzero D11. Furthermore, the gap between the upper and lower bounds can be bounded with the approximation parameter N and is independent of the discrete-time controller. This feature is significant in applying the new method especially to control system design, and this study indeed has a very close relationship to the recent progress in the study of control system analysis/design via noncausal linear periodically time-varying scaling. We demonstrate the effectiveness of the new method through a numerical example.
منابع مشابه
Modified fast-sample/fast-hold approximation and γ-independent H∞-discretisation for general sampled-data systems by fast-lifting
This paper is concerned with the fast-lifting approach to H∞ analysis and design of sampleddata systems, and extends our preceding study on modified fast-sample/fast-hold (FSFH) approximation, in which the direct feedthrough matrix D11 from the disturbance w to the controlled output z was assumed to be zero. More precisely, this paper removes this assumption and shows that a γ-independent H∞ di...
متن کاملOptimal Discretization of Analog Filters via Sampled-Data H-infinity Control Theory
In this article, we propose optimal discretization of analog filters (or controllers) based on the theory of sampled-data H∞ control. We formulate the discretization problem as minimization of the H∞ norm of the error system between a (delayed) target analog filter and a digital system including an ideal sampler, a zero-order hold, and a digital filter. The problem is reduced to discrete-time H...
متن کاملSampled-data Minimum Variance Filtering
This paper deals with the optimal solution to the sampled-data minimum variance filtering problem for linear systems with noise in the states and in the measurements. The solution is derived in the time-domain by using a fast sampling zeroorder hold input discretization of the continuous time systems together with a lifting technique. The original sampled-data system is transformed into an equi...
متن کاملL∞-induced norm analysis of sampled-data systems via piecewise constant and linear approximations
This paper deals with the L1 analysis of linear sampled-data systems, by which we mean the computation of the L∞induced norm of linear sampled-data systems. Two computation methods based on piecewise constant and piecewise linear approximations are provided through fast-lifting, by which the sampling interval [0, h) is divided into M subintervals with an equal width. Even though the central par...
متن کاملOptimal discretization of analog filters via sampled-data H∞ control theory
In this article, we propose optimal discretization of analog filters (or controllers) based on the theory of sampleddata H∞ control. We formulate the discretization problem as minimization of the H∞ norm of the error system between a (delayed) target analog filter and a digital system including an ideal sampler, a zero-order hold, and a digital filter. The problem is reduced to discrete-time H∞...
متن کامل